منابع مشابه
Counting Paths in Graphs
We give a simple combinatorial proof of a formula that extends a result by Grigorchuk [Gri78a, Gri78b] (rediscovered by Cohen [Coh82]) relating cogrowth and spectral radius of random walks. Our main result is an explicit equation determining the number of ‘bumps’ on paths in a graph: in a d-regular (not necessarily transitive) non-oriented graph let the series G(t) count all paths between two f...
متن کاملSnake bite envenomation: experience at King Abdulaziz Medical City, Riyadh.
We surveyed the records of 21 of the 28 snakebite victims seen at King Fahad National Guard Hospital in Riyadh over the 20-year period 1986-2005. The most common symptoms were local pain and swelling and the most common signs oedema and tenderness. Neurotoxicity was not noted in any case. Coagulopathy was recorded for 14/21 patients (66.7%) and 5/19 (26.4%) had leukocytosis. All patients were g...
متن کاملMonochromatic Paths and Triangulated Graphs
This paper considers two properties of graphs, one geometrical and one topolog-ical, and shows that they are strongly related. Let G be a graph with four distinguished and distinct vertices, w 1 ; w 2 ; b 1 ; b 2. Consider the two properties, T RI + (G) and M ON O(G), deened as follows. T RI + (G): There is a planar drawing of G such that: all 3-cycles of G are faces; all faces of G are triangl...
متن کاملBalanced Paths in Colored Graphs
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infinite path where either (i) all colors occur with the same asymptotic frequency, or (ii) there is a constant which bounds the difference between the occurrences of any two colors for all prefixes of the path. These two not...
متن کاملShortest Paths In Unweighed Graphs
When dealing with shortest paths in weighed or unweighed graphs, one may solve one-to-one, one-to-all or all-to-all instances. But the known algorithms compute one single shortest path of the considered instance. This article describes a new algorithm (patent pending) designed to compute all the shortest paths between two vertices of a directed, strongly connected and unweighed graph G, contain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Enumerative combinatorics and applications
سال: 2023
ISSN: ['2710-2335']
DOI: https://doi.org/10.54550/eca2023v3s2r16